Resource mapping method and device

ABSTRACT

Disclosed by the present application are a resource mapping method and apparatus and device, comprising: determining to-be-sent data hosted on a data-channel physical downlink shared channel (PDSCH)/physical uplink shared channel (PUSCH); mapping said to-be-sent data to a virtual resource block (VRB); mapping the virtual resource block to a physical resource block (PRB) in resource block (RB) bundle units. Using the present application, it is possible to prevent the problem of the size of a virtual resource block bundle being inconsistent with the size of a physical resource block bundle, thus causing it to be impossible to map the virtual resource block to the physical resource block.

The present application is continuation of U.S. patent application Ser.No. 16/959,707, filed on Jul. 2, 2020, which is a US National Stage ofInternational Application No. PCT/CN2018/120741, filed on Dec. 12, 2018,which claims the priority from Chinese Patent Application No.201810004885.0, filed with the China National Intellectual PropertyAdministration on Jan. 3, 2018 and entitled “Resource Mapping Method andApparatus and Device”, which is hereby incorporated by reference in itsentirety.

FIELD

The present application relates to the field of wireless communicationtechnologies and particularly to a resource mapping method, apparatusand device.

BACKGROUND

In the NR (Next generation Radio) technology, the data to be sent thatis carried by the data channel PDSCH (Physical Downlink SharedChannel)/PUSCH (Physical Uplink Shared Channel) is firstly mapped to aVRB (Virtual Resource Block), and then the VRB is mapped to a PRB(Physical Resource Block).

There are two types of VRB-to-PRB mapping: interleaved mapping andnon-interleaved mapping. The non-interleaved VRB-to-PRB mapping refersto that the VRB n is directly mapped to the PRB n. While for theinterleaved VRB-to-PRB mapping, the unit is RB bundle (RB: ResourceBlock), and the VRB bundle j is mapped to the PRB bundle f(j).

The deficiency of the prior art is that there are cases in which themapping from VRB to PRB cannot be finished.

SUMMARY

The present application provides a resource mapping method and apparatusand device, and to solve the problem that the existing VRB-to-PRBmapping may cause the VRB bundle and the PRB bundle to be inconsistentin size and the VRB-to-PRB mapping cannot be performed.

A resource mapping method provided in an embodiment of the presentapplication includes:

-   -   determining data to be sent that is carried on a data channel        Physical Downlink Shared Channel, PDSCH/Physical Uplink Shared        Channel, PUSCH;    -   mapping the data to be sent to Virtual Resource Blocks, VRBs;        and    -   mapping VRBs in a bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs        based on a scheme, where the scheme includes:    -   mapping VRB bundle N_(bundle)−1 to PRB bundle N_(bundle)−1; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . , M−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . ,        M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{N_(bundle)−K, . . .        , N_(bundle)−1};    -   and    -   mapping remaining VRB bundles based on bundle indexes through        interleaved mapping to corresponding PRB bundles;    -   where,    -   N_(bundle) is a quantity of RB bundles in a BWP, and the        N_(bundle) RB bundles are numbered from 0 to N_(bundle)−1 in an        order of frequency;    -   K is determined by:

K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1;

-   -   M is determined by:

M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1;

-   -   where P is a quantity of rows or columns of an interleaver.

A computer device provided in an embodiment of the present applicationincludes a memory, a processor and a computer program that is stored onthe memory and can run on the processor, where the processor, whenexecuting the computer program, implements the following method:

-   -   determining data to be sent that is carried on a data channel        PDSCH/PUSCH;    -   mapping the data to be sent to VRBs, and mapping VRBs in a        bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs based on a scheme,        where the scheme includes:    -   mapping VRB bundle N_(bundle)−1 to PRB bundle N_(bundle)−1; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . , M−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . ,        M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{N_(bundle)−K, . . .        , N_(bundle)−1};    -   and    -   mapping remaining VRB bundles based on bundle indexes through        interleaved mapping to corresponding PRB bundles;    -   and    -   N_(bundle) is a quantity of RB bundles in a BWP, and the        N_(bundle) RB bundles are numbered from 0 to N_(bundle)−1 in an        order of frequency;    -   K is determined by:

K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1;

-   -   M is determined by:

M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1;

-   -   where P is a quantity of rows or columns of an interleaver.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings illustrated here are used to provide thefurther understanding of the present application and constitute a partof the present application, and the schematic embodiments of the presentapplication and the illustration thereof are used to explain the presentapplication but not limit the present application improperly. In theaccompanying drawings:

FIG. 1 is a schematic diagram illustrating the size correspondence of RBbundles in an embodiment of the present application;

FIG. 2 is a schematic diagram of interleaved mapping of 12 RB bundles inan embodiment of the present application;

FIG. 3 is a schematic diagram of inconsistent interleaved mapping of 11RB bundles in an embodiment of the present application;

FIG. 4 is a schematic flow diagram of a resource mapping method in anembodiment of the present application;

FIG. 5 is a schematic diagram of the correspondence between RB indexesand RB bundle indexes in a first embodiment of the present application;

FIG. 6 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes in the firstembodiment of the present application;

FIG. 7 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 4-rowinterleaver in the first embodiment of the present application;

FIG. 8 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 6-columninterleaver in the first embodiment of the present application;

FIG. 9 is a schematic diagram of the correspondence between RB indexesand RB bundle indexes in a second embodiment of the present application;

FIG. 10 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes in the secondembodiment of the present application;

FIG. 11 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 4-rowinterleaver in the second embodiment of the present application;

FIG. 12 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes in a third embodimentof the present application;

FIG. 13 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 4-rowinterleaver in the third embodiment of the present application;

FIG. 14 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes when nulls beingfilled in the last column of the interleaver in the third embodiment ofthe present application;

FIG. 15 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes with an integermultiple of RBG being satisfied in the third embodiment of the presentapplication.

DETAILED DESCRIPTION OF THE EMBODIMENTS

For the interleaved VRB-to-PRB mapping, the unit is RB bundle, and thesize of the RB bundle is notified by the network side and is denoted asL during the process of mapping the VRB bundle j to the PRB bundle f(j).The size of the first RB bundle is L−N_(BWP,i) ^(start) mod L, whereN_(BWP,i) ^(start) is the starting CRB (Common Resource Block) index ofthe BWP (Band Width Part). Taking L=2 as an example, if the starting CRBindex of the BWP is an odd number, the size of the first RB bundle is 1RB; otherwise, the size of the first RB bundle is 2 RBs. FIG. 1 is aschematic diagram of the correspondence of the sizes of RB bundles,where the correspondence between RB bundles and CRBs is as shown in FIG.1 .

The mapping from the VRB bundle j to the PRB bundle f(j) needs tosatisfy:

f(j)=rC+c

j=cR+r

r=0,1, . . . ,R−1

c=0,1, . . . ,C−1

R=2

C=┌N _(BWP,i) ^(size)/(LR)┐

here L is the size of the RB bundle, and N_(BWP,i) ^(size) is the sizeof the BWP. The above formula is to write the RB bundle indexes into a2-row and C-column interleaver by column and then read them out by rowto realize the interleaved mapping from the VRB bundle indexes to thePRB bundle indexes.

Other methods are also used to express the interleaved mapping, e.g.,the matrix method. Conversion is performed according to thepredetermined rules or protocol requirements during the interleavedmapping. The embodiments of the present application will mainly take theabove formula as an example to illustrate by way of a row-columninterleaver.

In one embodiment, for example, it is assumed that N_(BWP,i) ^(start)=0,N_(BWP,i) ^(size)=24 and L=2. FIG. 2 is a schematic diagram of theinterleaved mapping of 12 RB bundles. As shown, there are 12 RB bundlesin the BWP, and the number of interleaver columns is C=6. The VRB bundleindexes are written into the 2-row and 6-column interleaver by columnand then read out by row to realize the interleaved mapping from the VRBbundle indexes to the PRB bundle indexes. The VRB bundles 0, 1, 2, 3, 4,5, 6, 7, 8, 9, 10, 11 are mapped to the PRB bundles 0, 2, 4, 6, 8, 10,1, 3, 5, 7, 9, 11 respectively, as shown in FIG. 2 .

Due to the starting CRB index of the BWP, the size of the BWP, and thesize of the RB bundle, the size of the first and last RB bundles in theBWP may be smaller than the size L of the RB bundle notified by thenetwork side.

When the size of the first RB bundle is less than L, the VRB bundle 0 isfixedly mapping to the PRB bundle 0, so there will be no such problemthat the size of the VRB bundle is inconsistent with the size of the PRBbundle. However, when the size of the last RB bundle is less than L, ifthe number of RB bundles in the BWP is an odd number, the situationwhere the VRB bundle is inconsistent with the PRB bundle in size mayoccur according to the existing VRB-to-PRB mapping rules. FIG. 3 is aschematic diagram illustrating the inconsistent interleaved mapping of11 RB bundles. It needs to be noted that some parts are shown by boldline boxes and circles. As shown, it is assumed that N_(BWP,i)^(size)=21 and L=2 in the figure. At this time, the VRB-to-PRB mappingcannot be finished especially when the number of RBs of the VRB bundleis greater than that of the PRB bundle.

Based on this, the embodiments of the present application is intended tosolve the problem that the existing VRB-to-PRB mapping may cause the VRBbundle and the PRB bundle to be inconsistent in size and the VRB-to-PRBmapping cannot be performed. The specific embodiments of the presentapplication will be illustrated below in combination with the drawings.

FIG. 4 is a schematic flow diagram of a resource mapping method, asshown, which includes:

Step 401: determining the data to be sent that is carried on a datachannel PDSCH/PUSCH. Here, the data channel is the PDSCH/PUSCH;

Step 402: mapping the data to be sent to VRBs; and

Step 403: mapping the VRBs to PRBs in units of RB bundle.

The specific ways of mapping the VRBs to the PRBs in units of RB bundlewill be illustrated below in combination with examples.

1. Mapping the VRBs to the PRBs in units of RB bundle, includes:

-   -   mapping VRBs in a bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs,        based on a scheme, here the scheme includes:    -   mapping VRB bundle N_(bundle)−1 to PRB bundle N_(bundle)−1; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . , M−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . ,        M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{N_(bundle)−K, . . .        , N_(bundle)−1};    -   and    -   mapping remaining VRB bundles based on bundle indexes through        interleaved mapping to corresponding PRB bundles;    -   here,    -   N_(bundle) is a quantity of RB bundles in a BWP, and the        N_(bundle) RB bundles are numbered from 0 to N_(bundle)−1 in an        order of frequency;    -   K is determined by:

K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1;

-   -   M is determined by:

M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1;

-   -   here P is a quantity of rows or columns of an interleaver.

In some embodiments, the Nbundle RB bundles are numbered from 0 toNbundle−1 in an increasing order of frequency or a decreasing order offrequency. The embodiments will take the Nbundle RB bundles beingnumbered from 0 to Nbundle−1 in the increasing order of frequency as anexample.

Further, in an implementation, P is the number of rows or columns of theinterleaver, including:

-   -   if the number of rows of the interleaver is fixed, P is the        number of rows of the interleaver;    -   if the number of columns of the interleaver is fixed, P is the        number of columns of the interleaver.

First Embodiment

In this embodiment, it is assumed that the number of RB bundles in theBWP is N_(bundle), and they are numbered as 0, 1, . . . , N_(bundle)−1in order from low to high frequency. Then, in the interleaved VRB-to-PRBmapping, the VRB bundle N_(bundle)−1 is fixedly mapped to the PRB bundleN_(bundle)−1; and the interleaved mapping is performed on the VRB bundle0 to VRB bundle N_(bundle)−2 based on their bundle indexes to determinethe corresponding PRB bundle indexes.

In one embodiment, FIG. 5 is a schematic diagram of the correspondencebetween RB indexes and RB bundle indexes in the first embodiment. Asshown, it is assumed that N_(BWP,i) ^(start)=0, N_(BWP,i) ^(size)=21 andL=2, and the RB bundle division is as shown in FIG. 5 . Here there are11 RB bundles, and the RB bundle 10 contains only one RB.

Then the VRB bundle 10 is fixedly mapped to the PRB bundle 10, and theinterleaved mapping is performed on the VRB bundle 0 to VRB bundle 9according to their bundle indexes to determine the corresponding PRBbundle indexes. FIG. 6 is a schematic diagram illustrating thecorrespondence between the VRB bundle indexes and the PRB bundle indexesin the first embodiment. As shown, it is assumed that the interleavedmapping from VRB bundles to PRB bundles follows the existing mappingmethod in the NR, then the VRB bundles 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 aremapped to the PRB bundles 0, 2, 4, 6, 8, 1, 3, 5, 7, 9 respectively, asshown in FIG. 6 .

In an implementation, the rows and columns of the interleaver areinterchangeable. For example, the number of columns of the interleaveris fixed to 2, and the number of rows is variable based on the BWP sizeand bundle size. Correspondingly, the RB bundle indexes are written byrow and read out by column.

In addition, the interleaved mapping from VRB bundles to PRB bundles isnot limited to the existing mapping method in the NR, because itsessence is just the correspondence transformation between indexes. Theembodiments of the present application do not limits the specific indexcorrespondence rule, so the use of other methods will not affect theimplementation of the embodiments of the present application.

For example, the number of rows of the above interleaver is increased to4, and the number of columns is decreased accordingly. The aboveassumption is still followed. FIG. 7 is a schematic diagram illustratingthe correspondence between the VRB bundle indexes and the PRB bundleindexes of the 4-row interleaver in the first embodiment. Then the VRBbundles 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 are mapped to the PRB bundles 0, 4,8, 1, 5, 9, 2, 6, 3, 7 respectively, as shown in FIG. 7 .

As another example, it is assumed that the number of RBs between thestarting RB of the VRB bundle 0 and the starting RB of the VRB bundle 1in the interleaved mapping from VRB bundles to PRB bundles is requiredto be an integer multiple of RBG, that is, C*L is an integer multiple ofthe RBG size, i.e.,

${C = {\lceil \frac{L_{total}*L}{2*{RBG}} \rceil*\frac{RBG}{L}}},$

where L_(total) is the total number of RB bundles that involved ininterleaving. And it is agreed that the C*2−L_(total) elements in thelast row of the interleaver are empty, and the position where theelement is empty is not written with VRB bundle indexes during thewriting process and not read out from when the PRB bundle indexes areread out. The above assumption is still followed, and it is furtherassumed that the size of the RBG (Resource Block Group) corresponding tothe BWP is 4 (the size of the RBG is always an integer multiple of thesize of the RB bundle). FIG. 8 is a schematic diagram illustrating thecorrespondence between the VRB bundle indexes and the PRB bundle indexesof the 6-column interleaver in the first embodiment. Then the number Cof the interleaver columns is increased to 6, and the VRB bundles 0, 1,2, 3, 4, 5, 6, 7, 8, and 9 are mapped to the PRB bundles 0, 2, 4, 6, 8,8, 9, 1, 3, 5, and 7 respectively, as shown in FIG. 8 .

Second Embodiment

In this embodiment, it is assumed that the number of RB bundles in theBWP is N_(bundle), and they are numbered as 0, 1, . . . , N_(bundle)−1in order from low to high frequency. Then, in the interleaved VRB-to-PRBmapping, the first M VRB bundles are fixedly and directly mapped to thePRB bundles with the same indexes as the VRB bundles; and theinterleaved mapping is performed on the VRB bundle M to VRB bundleN_(bundle)−1 according to their bundle indexes to determine thecorresponding PRB bundle indexes.

Assuming the number of interleaver rows is fixed to R, then

$M = {N - {\lfloor \frac{N}{R} \rfloor*{R.}}}$

In one embodiment, FIG. 9 is a schematic diagram of the correspondencebetween RB indexes and RB bundle indexes in the second embodiment. Asshown, the assumption of the first embodiment is still followed, whereN_(BWP,i) ^(start)=0, N_(BWP,i) ^(size)=21 and L=2. The RB bundledivision is as shown in FIG. 9 .

Assuming that an NR interleaver is used and the number of interleaverrows is fixed to R=2, then

${M = {{11 - {\lfloor \frac{11}{2} \rfloor*2}} = 1}},$

where the VRB bundle 0 is fixedly mapped to the PRB bundle 0, and theinterleaved mapping is performed on the VRB bundle 1 to VRB bundle 10according to their bundle indexes to determine the corresponding PRBbundle indexes. FIG. 10 is a schematic diagram illustrating thecorrespondence between the VRB bundle indexes and the PRB bundle indexesin the second embodiment, and the details are as shown in FIG. 10 .

FIG. 11 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 4-rowinterleaver in the second embodiment. Assuming that the number ofinterleaver rows is R=4, then

${M = {{11 - {\lfloor \frac{11}{4} \rfloor*4}} = 3}},$

where the VRB bundle 0 to VRB bundle 2 are fixedly mapped to the PRBbundle 0 to PRB bundle 2 respectively, and the interleaved mapping isused for the VRB bundle 3 to VRB bundle 10 to determine thecorresponding PRB bundle indexes. The details are as shown in FIG. 11 .

2. Mapping the VRBs to the PRBs in units of RB bundle, includes:

-   -   determining the PRB bundle indexes corresponding to all VRB        bundles through interleaved mapping;    -   inserting (C*R−N_(bundle)) nulls in the last row or last column        of an interleaver, and ignoring nulls when reading out from the        interleaver.

Here N_(bundle) is the number of RB bundles in the BWP, R is the numberof rows of the interleaver, and C is the number of columns of theinterleaver.

In an implementation, inserting (C*R−N_(bundle)) nulls in the last rowor last column of an interleaver, includes:

-   -   the inserted nulls do not occupy the last element position of        the last row or last column of the interleaver.

In an implementation, the inserting (C*R−N_(bundle)) nulls in the lastrow or last column of an interleaver, includes:

-   -   if the VRB bundle indexes are written into the interleaver by        row and read out from the interleaver by column, then inserting        (C*R−N_(bundle)) nulls in the last row or last column of the        interleaver by inserting (C*R−N_(bundle)) nulls in the last row        of the interleaver;    -   if the VRB bundle indexes are written into the interleaver by        column and read out from the interleaver by row, then inserting        (C*R−N_(bundle)) nulls in the last row or last column of the        interleaver by inserting (C*R−N_(bundle)) nulls in the last        column of the interleaver.

Third Embodiment

In this embodiment, it is assumed that the number of RB bundles in theBWP is N_(bundle), and they are numbered as 0, 1, . . . , N_(bundle)−1in order from low to high frequency. The number of rows of theinterleaver is fixed to R, and the number C of columns of theinterleaver is variable based on the BWP size and the bundle size (therows and columns of the interleaver may be interchanged in theimplementation). The VRB bundle indexes are written into the interleaverby column and read out by row. The first (C*R−N_(bundle)) rows in thelast column of the interleaver are filled with nulls, and the positionsfilled with null are not written with VRB bundle indexes during writingand not read out from when the PRB bundle indexes are read out.

FIG. 12 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes in the thirdembodiment. Assuming that an NR interleaver is used and the number ofrows of the interleaver is R=2, then the first 2*6−11=1 row in the lastcolumn of the interleaver is filled with null, as shown in FIG. 12 .

FIG. 13 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes of the 4-rowinterleaver in the third embodiment. Assuming that the number of rows ofthe interleaver is increased to R=4, then the first 4*3−11=1 row in thelast column of the interleaver is filled with null, as shown in FIG. 13.

FIG. 14 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes when null is filled inthe last column of the interleaver in the third embodiment, where thenull filled in the last column of the interleaver may also be at anotherelement position except the last row, as shown in FIG. 14 .

FIG. 15 is a schematic diagram illustrating the correspondence betweenthe VRB bundle indexes and the PRB bundle indexes where integer multipleof RBG is satisfied in the third embodiment. Assuming that the number ofRBs between the starting RB of the VRB bundle 0 and the starting RB ofthe VRB bundle 1 in the interleaved mapping from VRB bundles to PRBbundles is required to be an integer multiple of RBG, similarly to thefirst embodiment, then the first 2*6−11=1 row in the last column of theinterleaver is filled with null, as shown in FIG. 15 .

In an implementation, before the mapping VRBs in the bundle j∈{0, 1, . .. , N_(bundle)−1} to PRBs based on the scheme, the method may furtherinclude:

-   -   determining the number N_(bundle) of RB bundles in the BWP        and/or whether the size of the last RB bundle is less than L,        and determining whether to map the VRBs to the PRBs in units of        RB bundle according to the judgment result, where L is the size        of a RB bundle.

The number of RB bundles in the BWP and/or whether the size of the lastRB bundle is less than L is/are determined, and it is determined whetherto apply the first, second or third embodiment according to thedetermining result.

In an implementation, the determining the number N_(bundle) of RBbundles in the BWP, includes:

-   -   determining whether the number N_(bundle) of RB bundles in the        BWP is an integer multiple of the number of interleaver rows or        the number of interleaver columns.

In an implementation, the determining whether the number N_(bundle) ofRB bundles in the BWP is an integer multiple of the number ofinterleaver rows or the number of interleaver columns, includes:

-   -   if the number of interleaver rows is fixed, determining whether        the number N_(bundle) of RB bundles in the BWP is an integer        multiple of the number of interleaver rows;    -   if the number of interleaver columns is fixed, determining        whether the number N_(bundle) of RB bundles in the BWP is an        integer multiple of the number of interleaver columns.

The specific implementation may be as follows.

For example, it is determined whether the number of RB bundles in theBWP is an integer multiple of the number of interleaver rows or thenumber of interleaver columns. If it is not an integer multiple of thenumber of interleaver rows or the number of interleaver columns, thefirst, second or third embodiment is applied; otherwise, the interleavedmapping is performed on all the VRB bundles in the BWP according totheir bundle indexes to determine the corresponding PRB bundle indexes,for example, using the existing mechanism.

For example, it is determined whether the size of the last RB bundle isless than L. If it is less than L, the first, second or third embodimentis applied; otherwise, the interleaved mapping is performed on all theVRB bundles in the BWP according to their bundle indexes to determinethe corresponding PRB bundle indexes, for example, using the existingmechanism.

For example, the number of RB bundles in the BWP and whether the size ofthe last RB bundle is less than L are determined. If it is determinedthat the number of RB bundles in the BWP is not an integer multiple ofthe number of interleaver rows or the number of interleaver columns andthe size of the last RB bundle is less than L, the first, second orthird embodiment is applied; otherwise, the interleaved mapping isperformed on all the VRB bundles in the BWP according to their bundleindexes to determine the corresponding PRB bundle indexes, for example,using the existing mechanism.

The embodiments of the present application further provide a computerdevice, a computer readable storage medium, and a resource mappingapparatus. Since the principle solving the problem of these devices issimilar to the resource mapping method, the implementations of thesedevices may refer to the implementations of the method, and the repeateddescription thereof will be omitted here.

A computer device provided in an embodiment of the present applicationincludes a memory, a processor and a computer program that is stored onthe memory and can run on the processor, where the processor, whenexecuting the computer program, implements the following method:

-   -   determining the data to be sent that is carried on a data        channel PDSCH/PUSCH;    -   mapping the data to be sent to VRBs; and    -   mapping the VRBs to PRBs in units of RB bundle.

In an implementation, mapping the VRBs to PRBs in units of RB bundle,includes:

-   -   mapping VRBs in a bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs,        based on a scheme, where the scheme includes:    -   mapping VRB bundle N_(bundle)−1 to PRB bundle N_(bundle)−1; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . , M−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{0, . . . ,        M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; or    -   mapping VRB bundle i to PRB bundle i, and i∈{N_(bundle)−K, . . .        , N_(bundle)−1};    -   and    -   mapping remaining VRB bundles based on bundle indexes through        interleaved mapping to corresponding PRB bundles;    -   here,    -   N_(bundle) is a quantity of RB bundles in a BWP, and the        N_(bundle) RB bundles are numbered from 0 to N_(bundle)−1 in an        order of frequency;    -   K is determined by:

K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1;

-   -   M is determined by:

M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1;

-   -   here P is a quantity of rows or columns of an interleaver.

In an implementation, P is the number of rows or columns of theinterleaver, including:

-   -   if the number of rows of the interleaver is fixed, P is the        number of rows of the interleaver;    -   if the number of columns of the interleaver is fixed, P is the        number of columns of the interleaver.

In an implementation, mapping the VRBs to PRBs in units of RB bundle,includes:

-   -   determining the PRB bundle indexes corresponding to all VRB        bundles through interleaved mapping; and    -   inserting (C*R−N) nulls in the last row or last column of an        interleaver, and ignoring nulls when reading out from the        interleaver;    -   where N is the number of RB bundles in the BWP, R is the number        of rows of the interleaver, and C is the number of columns of        the interleaver.

In an implementation, the inserting (C*R−N) nulls in the last row orlast column of an interleaver, includes:

-   -   the inserted nulls do not occupy the last element position of        the last row or last column of the interleaver.

In an implementation, the inserting (C*R−N) nulls in the last row orlast column of an interleaver, includes:

-   -   if the VRB bundle indexes are written into the interleaver by        row and read out from the interleaver by column, then inserting        (C*R−N) nulls in the last row or last column of the interleaver        by inserting (C*R−N) nulls in the last row of the interleaver;    -   if the VRB bundle indexes are written into the interleaver by        column and read out from the interleaver by row, then inserting        (C*R−N) nulls in the last row or last column of the interleaver        by inserting (C*R−N) nulls in the last column of the        interleaver.

In some embodiments, the N_(bundle) RB bundles are numbered from 0 toN_(bundle)−1 in an increasing order of frequency or a decreasing orderof frequency.

In an implementation, before mapping VRBs in a bundle j∈{0, 1, . . . ,N_(bundle)−1} to PRBs based on the scheme, the method further includes:

-   -   determining whether a size of a last RB bundle is less than L,        and determining to map the VRBs in the bundle j to the PRBs        based on the scheme if the size of the last RB bundle is less        than L, and L is a size of a RB bundle.

In an implementation, before mapping VRBs in a bundle j∈{0, 1, . . . ,N_(bundle)−1} to PRBs based on the scheme, the method further includes:

-   -   determining whether N_(bundle) is an integer multiple of the        quantity of interleaver rows or the quantity of interleaver        columns; and    -   if N_(bundle) is not the integer multiple of the quantity of        interleaver rows or the quantity of interleaver columns,        determining to map the VBRs in the bundle j to the PRBs base on        the scheme.

In an implementation, the determining whether the number N_(bundle) ofRB bundles in the BWP is an integer multiple of the number ofinterleaver rows or the number of interleaver columns, includes:

-   -   if the number of interleaver rows is fixed, determining whether        the number N_(bundle) of RB bundles in the BWP is an integer        multiple of the number of interleaver rows;    -   if the number of interleaver columns is fixed, determining        whether the number N_(bundle) of RB bundles in the BWP is an        integer multiple of the number of interleaver columns.

An embodiment of the present application provides a computer readablestorage medium storing a computer program that performs the resourcemapping method described above. The details may refer to theimplementations of the computer device.

A resource mapping apparatus provided in an embodiment of the presentapplication includes:

-   -   a determining device configured to determine the data to be sent        that is carried on a data channel PDSCH/PUSCH; and    -   a mapping device configured to map the data to be sent to VRBs,        and map the VRBs to PRBs in units of RB bundle.

For the sake of description, all the parts of the above-mentioned deviceare divided into various modules or units by function, which aredescribed respectively. Of course, the functions of the various modulesor units may be implemented in the same one or more software or hardwarewhen the present application is implemented.

In summary, the embodiments of the present application provides themapping solution from the VRB bundle to the PRB bundle, which can avoidthe problem that the VRB bundle and the PRB bundle are inconsistent insize and the VRB-to-PRB mapping cannot be performed.

The embodiments of the present application can provide methods, systemsand computer program products. Thus the present application can take theform of hardware embodiments alone, software embodiments alone, orembodiments combining the software and hardware aspects. Also thepresent application can take the form of computer program productsimplemented on one or more computer usable storage mediums (includingbut not limited to magnetic disk memories, CD-ROMs, optical memories andthe like) containing computer usable program codes therein.

The present application is described by reference to the flow chartsand/or the block diagrams of the methods, the devices (systems) and thecomputer program products according to the embodiments of the presentapplication. It should be understood that each process and/or block inthe flow charts and/or the block diagrams, and a combination ofprocesses and/or blocks in the flow charts and/or the block diagrams canbe implemented by the computer program instructions. These computerprogram instructions can be provided to a general-purpose computer, adedicated computer, an embedded processor, or a processor of anotherprogrammable data processing device to produce a machine, and anapparatus for implementing the functions specified in one or moreprocesses of the flow charts and/or one or more blocks of the blockdiagrams is produced by the instructions executed by the computer or theprocessor of another programmable data processing device.

These computer program instructions can also be stored in a computerreadable memory which may guide the computer or another programmabledata processing device to operate in a particular way, and theinstructions stored in the computer readable memory produce amanufacture including the instruction apparatus which implements thefunctions specified in one or more processes of the flow charts and/orone or more blocks of the block diagrams.

These computer program instructions can also be loaded onto the computeror another programmable data processing device, and a series ofoperation steps are performed on the computer or another programmabledevice to produce the computer-implemented processing. Thus theinstructions executed on the computer or another programmable deviceprovide steps for implementing the functions specified in one or moreprocesses of the flow charts and/or one or more blocks of the blockdiagrams.

Although the embodiments of the present application have been described,additional alterations and modifications to these embodiments may bemade. Thus the attached claims are intended to be interpreted to includethe embodiments as well as all the alterations and modifications fallingwithin the scope of the present application.

What is claimed is:
 1. A resource mapping method performed by anapparatus, comprising: determining data to be sent that is carried on adata channel Physical Downlink Shared Channel, PDSCH/Physical UplinkShared Channel, PUSCH; mapping the data to be sent to Virtual ResourceBlocks, VRBs; and mapping VRBs in a bundle j∈{0, 1, . . . ,N_(bundle)−1} to Physical Resource Blocks, PRBs, based on a scheme,wherein the scheme comprises: mapping VRB bundle N_(bundle)−1 to PRBbundle N_(bundle)−1; or mapping VRB bundle i to PRB bundle i, whereini∈{0, . . . , M−1}; or mapping VRB bundle i to PRB bundle i, whereini∈{0, . . . , M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; or mapping VRBbundle i to PRB bundle i, wherein i∈{N_(bundle)−K, . . . ,N_(bundle)−1}; and mapping remaining VRB bundles based on bundle indexesthrough interleaved mapping to corresponding PRB bundles; wherein,N_(bundle) is a quantity of RB bundles in a BWP, and the N_(bundle) RBbundles are numbered from 0 to N_(bundle)−1 in an order of frequency; Kis determined by:K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1; M is determined by:M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1; wherein P is a quantity ofrows or columns of an interleaver.
 2. The method of claim 1, wherein, Pis the quantity of rows or columns of the interleaver, comprising: ifthe quantity of rows of the interleaver is fixed, P is the quantity ofrows of the interleaver; if the quantity of columns of the interleaveris fixed, P is the quantity of columns of the interleaver.
 3. The methodof claim 1, wherein the N_(bundle) RB bundles are numbered from 0 toN_(bundle)−1 in an increasing order of frequency or a decreasing orderof frequency.
 4. The method of claim 3, wherein, before the mapping VRBsin the bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs based on thescheme, the method further comprises: determining whether a size of alast RB bundle is less than L, and determining to map the VRBs in thebundle j to the PRBs based on the scheme if the size of the last RBbundle is less than L, wherein L is a size of a RB bundle.
 5. The methodof claim 2, wherein the N_(bundle) RB bundles are numbered from 0 toN_(bundle)−1 in an increasing order of frequency or a decreasing orderof frequency.
 6. The method of claim 5, wherein, before the mapping VRBsin the bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs based on thescheme, the method further comprises: determining whether a size of alast RB bundle is less than L, and determining to map the VRBs in thebundle j to the PRBs based on the scheme if the size of the last RBbundle is less than L, wherein L is a size of a RB bundle.
 7. The methodof claim 5, wherein, before the mapping VRBs in the bundle j∈{0, 1, . .. , N_(bundle)−1} to PRBs based on the scheme, the method furthercomprises: determining whether N_(bundle) is an integer multiple of thequantity of interleaver rows or the quantity of interleaver columns; andif N_(bundle) is not the integer multiple of the quantity of interleaverrows or the quantity of interleaver columns, determining to map the VBRsin the bundle j to the PRBs base on the scheme.
 8. The method of claim1, wherein, before the mapping VRBs in the bundle j∈{0, 1, . . . ,N_(bundle)−1} to PRBs based on the scheme, the method further comprises:determining whether N_(bundle) is an integer multiple of the quantity ofinterleaver rows or the quantity of interleaver columns; and ifN_(bundle) is not the integer multiple of the quantity of interleaverrows or the quantity of interleaver columns, determining to map the VBRsin the bundle j to the PRBs base on the scheme.
 9. The method of claim8, wherein, the determining whether N_(bundle) is the integer multipleof the quantity of interleaver rows or the quantity of interleavercolumns, comprises: if the quantity of interleaver rows is fixed,determining whether N_(bundle) is an integer multiple of the quantity ofinterleaver rows; if the quantity of interleaver columns is fixed,determining whether N_(bundle) is an integer multiple of the quantity ofinterleaver columns.
 10. The method of claim 2, wherein, before themapping VRBs in the bundle j∈{0, 1, . . . , N_(bundle)−1} to PRBs basedon the scheme, the method further comprises: determining whetherN_(bundle) is an integer multiple of the quantity of interleaver rows orthe quantity of interleaver columns; and if N_(bundle) is not theinteger multiple of the quantity of interleaver rows or the quantity ofinterleaver columns, determining to map the VBRs in the bundle j to thePRBs base on the scheme.
 11. A computer device comprising a memory, aprocessor and a computer program that is stored on the memory and canrun on the processor, wherein, the processor, when executing thecomputer program, implements a following method: determining data to besent that is carried on a data channel Physical Downlink Shared Channel,PDSCH/Physical Uplink Shared Channel, PUSCH; and mapping the data to besent to Virtual Resource Blocks, VRBs, and map VRBs in a bundle j ∈{0,1, . . . , N_(bundle)−1} to Physical Resource Blocks, PRBs, based on ascheme, wherein the scheme comprises: mapping VRB bundle N_(bundle)−1 toPRB bundle N_(bundle)−1; or mapping VRB bundle i to PRB bundle i,wherein i∈{0, . . . , M−1}; or mapping VRB bundle i to PRB bundle i,wherein i∈{0, . . . , M−1}∪{N_(bundle)−K, . . . , N_(bundle)−1}; ormapping VRB bundle i to PRB bundle i, wherein i∈{N_(bundle)−K, . . . ,N_(bundle)−1}; and mapping remaining VRB bundles based on bundle indexesthrough interleaved mapping to corresponding PRB bundles; wherein,N_(bundle) is a quantity of RB bundles in a BWP, and the N_(bundle) RBbundles are numbered from 0 to N_(bundle)−1 in an order of frequency; Kis determined by:K=N _(bundle) −└N _(bundle) /P┘×P, and K≥1; M is determined by:M=N _(bundle) −└N _(bundle) /P┘×P, and M≥1; wherein P is a quantity ofrows or columns of an interleaver.
 12. The computer device of claim 11,wherein, P is the quantity of rows or columns of the interleaver,comprising: if the quantity of rows of the interleaver is fixed, P isthe quantity of rows of the interleaver; if the quantity of columns ofthe interleaver is fixed, P is the quantity of columns of theinterleaver.
 13. The computer device of claim 11, wherein the N_(bundle)RB bundles are numbered from 0 to N_(bundle)−1 in an increasing order offrequency or a decreasing order of frequency.
 14. The computer device ofclaim 13, wherein, before the mapping VRBs in the bundle j ∈{0, 1, . . ., N_(bundle)−1} to PRBs based on the scheme, the method furthercomprises: determining whether a size of a last RB bundle is less thanL, and determining to map the VRBs in the bundle j to the PRBs based onthe scheme if the size of the last RB bundle is less than L, wherein Lis a size of a RB bundle.
 15. The computer device of claim 12, whereinthe N_(bundle) RB bundles are numbered from 0 to N_(bundle)−1 in anincreasing order of frequency or a decreasing order of frequency. 16.The computer device of claim 15, wherein, before the mapping VRBs in thebundle j ∈{0, 1, . . . , N_(bundle)−1} to PRBs based on the scheme, themethod further comprises: determining whether a size of a last RB bundleis less than L, and determining to map the VRBs in the bundle j to thePRBs based on the scheme if the size of the last RB bundle is less thanL, wherein L is a size of a RB bundle.
 17. The computer device of claim15, wherein, before the mapping VRBs in the bundle j ∈{0, 1, . . . ,N_(bundle)−1} to PRBs based on the scheme, the method further comprises:determining whether N_(bundle) is an integer multiple of the quantity ofinterleaver rows or the quantity of interleaver columns; and ifN_(bundle) is not the integer multiple of the quantity of interleaverrows or the quantity of interleaver columns, determining to map the VBRsin the bundle j to the PRBs base on the scheme.
 18. The computer deviceof claim 11, wherein, before the mapping VRBs in the bundle j ∈{0, 1, .. . , N_(bundle)−1} to PRBs based on the scheme, the method furthercomprises: determining whether N_(bundle) is an integer multiple of thequantity of interleaver rows or the quantity of interleaver columns; andif N_(bundle) is not the integer multiple of the quantity of interleaverrows or the quantity of interleaver columns, determining to map the VBRsin the bundle j to the PRBs base on the scheme.
 19. The computer deviceof claim 18, wherein, the determining whether N_(bundle) is the integermultiple of the quantity of interleaver rows or the quantity ofinterleaver columns, comprises: if the quantity of interleaver rows isfixed, determining whether N_(bundle) is an integer multiple of thequantity of interleaver rows; if the quantity of interleaver columns isfixed, determining whether N_(bundle) is an integer multiple of thequantity of interleaver columns.
 20. The computer device of claim 12,wherein, before the mapping VRBs in the bundle j ∈{0, 1, . . . ,N_(bundle)−1} to PRBs based on the scheme, the method further comprises:determining whether N_(bundle) is an integer multiple of the quantity ofinterleaver rows or the quantity of interleaver columns; and ifN_(bundle) is not the integer multiple of the quantity of interleaverrows or the quantity of interleaver columns, determining to map the VBRsin the bundle j to the PRBs base on the scheme.